The odds of eternal optimization in OT

نویسنده

  • Paul Boersma
چکیده

It is often suggested that if all sound change were due to optimizations of functional principles (minimization of articulatory effort, minimization of perceptual confusion), then sound systems should have increasingly improved during the course of history, probably to the point that they should by now have reached a stable optimum. Since the facts show, however, that sound systems tend never to stop changing, the conclusion must be, so the story goes, that optimization cannot be a major internal factor in sound change. But it may all depend on how we define optimization. In Boersma (1989), I showed that there is a simple optimization strategy that may be cyclic, and that this cyclicity is attested in the Germanic consonant shifts. In Boersma (1997), I showed that this optimization strategy is equivalent to a non-teleological random ranking of constraints in an Optimality-Theoretic grammar. In this chapter, I shall show that the cyclicity attested in the Germanic consonant shifts is not due to a large coincidence, but that, given random ranking of invisible constraints in OT, this cyclicity is expected in a large fraction of all sound changes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Eternal m-security subdivision numbers in graphs

An eternal $m$-secure set of a graph $G = (V,E)$ is aset $S_0subseteq V$ that can defend against any sequence ofsingle-vertex attacks by means of multiple-guard shifts along theedges of $G$. A suitable placement of the guards is called aneternal $m$-secure set. The eternal $m$-security number$sigma_m(G)$ is the minimum cardinality among all eternal$m$-secure sets in $G$. An edge $uvin E(G)$ is ...

متن کامل

Eternal m- Security Subdivision Numbers in Graphs

Let  be a simple graph with vertex set  and edges set . A set  is a dominating set if every vertex in  is adjacent to at least one vertex  in . An eternal 1-secure set of a graph G is defined as a dominating set  such that for any positive integer k and any sequence  of vertices, there exists a sequence of guards   with  and either  or  and  is a dominating set. If we take a guard on every ver...

متن کامل

An Efficient Protocol for Embryonic Carcinoma Cells P19 Differentiation to Cardiomyocytes Using Oxytocin as Inducer

Background: The capability of embryonic carcinoma cells P19 in differentiation to Cardiomyocyte was examined through inducing effects of Oxytocin (OT) and 5-Azacytidin (5Az) individually and compared with each other in laboratory condition. Materials and Methods: P19 Embryoid Bodies (EBs) was formed through hanging drops method. Then, EBs were treated with (5Az) or (OT) and the EB medium (Ct...

متن کامل

The 50th Anniversary of Occupational Therapy in Iran

This year is the 50th anniversary of Occupational Therapy (OT) in Iran. This is a hallmark to reflect on our achievements and plan for the future. Iranian OT was established in 1971 in Shafa Rehabilitation Hospital [1]. I can imagine how many people who were the managers facilitating the foundation of the department or those who were overseas occupational therapists were excited at the time. Th...

متن کامل

A ROBUST OPTIMIZATION MODEL FOR BLOOD SUPPLY CHAIN NETWORK DESIGN

The eternal need for humans' blood as a critical commodity makes the healthcare systems attempt to provide efficient blood supply chains (BSCs) by which the requirements are satisfied at the maximum level. To have an efficient supply of blood, an appropriate planning for blood supply chain is a challenge which requires more attention. In this paper, we address a mixed integer linear programming...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000